Stopping criteria for the Ando–Li–Mathias and Bini–Meini–Poloni geometric means
نویسندگان
چکیده
منابع مشابه
Stopping Criteria for SVMs
The support vector machine has been shown to be comparable to the state of the art for classification. In certain situations however, the convergence to a global optimum of the optimization problem can be very slow. It is shown that solutions suboptimal in terms of the optimization problem can still have very good performance. By using a heuristic stopping criterion (termed HERMES) these soluti...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولStopping Criteria for Mixed Finite Element Problems
Abstract. We study stopping criteria that are suitable in the solution by Krylov space based methods of linear and non linear systems of equations arising from the mixed and the mixed-hybrid finite-element approximation of saddle point problems. Our approach is based on the equivalence between the Babuška and Brezzi conditions of stability which allows us to apply some of the results obtained i...
متن کاملStopping Criteria for Single-Objective Optimization
In most literature dealing with evolutionary algorithms the stopping criterion consists of reaching a certain number of objective function evaluations (or a number of generations, respectively). A disadvantage is that the number of function evaluations that is necessary for convergence is unknown a priori, so trialand-error methods have to be applied for finding a suitable number. By using othe...
متن کاملStopping Criteria for Adaptive Finite Element Solvers
We consider a family of practical stopping criteria for linear solvers for adaptive finite element methods for symmetric elliptic problems. A contraction property between two consecutive levels of refinement of the adaptive algorithm is shown when the a family of smallness criteria for the corresponding linear solver residuals are assumed on each level or refinement. More importantly, based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.12.013